EFFECTIVE UTILIZATION OF IDLE TIME IN AN (s,S) INVENTORY WITH POSITIVE SERVICE TIME
نویسندگان
چکیده
We deviate from the Berman et al. models in inventory with positive service time. We establish a necessary and sufficient condition for system stability. Several performance measures are computed. An optimisation problem is discussed. Our analysis suggests that it is optimal to place the replenishment order when the inventory level is positive (even in the zero lead time case). Numerical illustrations are provided.
منابع مشابه
Perishable Inventory Model with Retrial Demands, Negative Customers and Multiple Working Vacations
This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملA single server perishable inventory system with N additional options for service
This article presents a perishable (s; S) inventory system under continuous review at a service facility in which a waiting hall for customers is of nite size M. The arrival instants of customers to the service station constitutes a Poisson process. The life time of each items is assumed to be exponential. All arriving customers demand the rst "essential" service, whereas only some of them dema...
متن کاملBudgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time
Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کامل